Structuring multi-dimensional subshifts
نویسندگان
چکیده
We study two relations on multi-dimensional subshifts: A pre-order based on the patterns configurations contain and the Cantor-Bendixson rank. We exhibit several structural properties of two-dimensional subshifts: We characterize the simplest aperiodic configurations in countable SFTs, we give a combinatorial characterization of uncountable subshifts, we prove that there always exists configurations without any periodicity but that have the simplest possible combinatorics in countable SFTs. Finally, we prove that some Cantor-Bendixson ranks are impossible for countable SFTs, leaving only a few unknown
منابع مشابه
Strong cocycle triviality for Z2 subshifts
We consider the cohomology of two-dimensional subshifts, and develop a new approach to proving that every cocycle is trivial (i.e. cohomologous to a homomorphism). We introduce semi-safe subshifts which, roughly speaking, have the property that some symbol can surround all allowed blocks in at least one horizontal and one vertical direction. We prove that for such subshifts, every locally const...
متن کاملOn the Spatial Entropy of Two-Dimensional Golden Mean
The dynamical properties of one-dimensional subshifts of finite type (Markov shifts) are well understood. However, not much is known for a general theory of higher dimensional subshifts. For instance, the spatial entropy of subshifts of finite type is known to be the logarithm of the largest eigenvalue of its corresponding transition matrix. On the other hand, very little is known on the spatia...
متن کاملComputing the entropy of one-dimensional decidable subshifts
We characterise the difficulty of computing topological entropy of one-dimensional subshifts under various dynamical restrictions. Entropy is known to be computable from above for general one-dimensional subshifts, and the aim of the article is to distinguish under which dynamical properties it becomes computable. The considered properties are minimality, unique ergodicity, and various forms of...
متن کاملAlgorithmic Complexity for the Realization of an Effective Subshift By a Sofic
Realization of d-dimensional effective subshifts as projective sub-actions of d + d′-dimensional sofic subshifts for d′ ≥ 1 is now well known [6, 4, 2]. In this paper we are interested in qualitative aspects of this realization. We introduce a new topological conjugacy invariant for effective subshifts, the speed of convergence, in view to exhibit algorithmic properties of these subshifts in co...
متن کاملThe Spatial Entropy of Two-Dimensional Subshifts of Finite Type
In this paper, two recursive formulas for computing the spatial entropy of two-dimensional subshifts of finite type are given. The exact entropy of a nontrivial example arising in cellular neural networks is obtained by using such formulas. We also establish some general theory concerning the spatial entropy of two-dimensional subshifts of finite type. In particular, we show that if either of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1309.6289 شماره
صفحات -
تاریخ انتشار 2013